Burrows-Wheeler compression with modified sort orders and exceptions to the MTF phase, and their impact on the compression rate
نویسنده
چکیده
This thesis examines two modifications of the Burrows-Wheeler compression algorithm. The effect of non-standard sort orders during the sorting phase of the Burrows-Wheeler transform is analyzed and a new method to find good sort orders developed and compared to previous work. The process is generalized to allow multiple sort orders in the transform and the reversibility in some cases is shown. Further, the second phase of the algorithm is examined and partial exceptions of it are considered to increase compression.
منابع مشابه
High-performance BWT-based Encoders
In 1994, Burrows and Wheeler [5] developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, M...
متن کاملAn Error-Resilient Blocksorting Compression Algorithm
A Burrows-Wheeler Compressor breaks input into blocks, quickly makes each more compressible, and compresses the modified block with a simple arithmetic or Huffman compressor. We propose an error-resilient Inverse Burrows-Wheeler Compressor. It uses a small amount of overhead alongside output from an ordinary BWT and MTF. It is also size-competitive with BZIP, a popular Burrows-Wheeler compressor.
متن کاملUniversal Decremental Redundancy Compression with Fountain Codes
A new universal noise-robust lossless compression algorithm based on a decremental redundancy approach with Fountain codes is proposed. The binary entropy code is harnessed to compress complex sources with the addition of a preprocessing system in this paper. Both the whole binary entropy range compression performance and the noise-robustness of an existing incremental redundancy Fountain code ...
متن کاملBurrows-Wheeler compression: Principles and reflections
After a general description of the Burrows Wheeler Transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded that the original scheme proposed by Wheeler is extremely efficient and unlikely to be much improved. The paper then proposes some new interpreta...
متن کاملThe Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements
A recent development in text compression is a “block sorting” algorithm which permutes the input text according to a special sort procedure and then processes the permuted text with Move-to-Front and a final statistical compressor. The technique combines good speed with excellent compression performance. This paper investigates the fundamental operation of the algorithm and presents some improv...
متن کامل